A Pipelined Indexing Hash Table using Bloom and Fingerprint Filters for IP Lookup
نویسندگان
چکیده
Since achieving a scalable IP lookup has been a critical data path for high-speed routers, such a HT with a predictable lookup throughput for a large prefix table is desirable for these routers. In this paper, we propose a pipelined indexing hash table (PIHT) by using both pipelined BFs in binary search for a key’s fingerprint and a fingerprint filter for memory-efficient approximate match. For the IP lookup, a tree-aware prefix collapsing (TPC) converts prefixes with wildcards to collapsed prefixes (CPs) and strides, so that both the PIHT on CPs and bit vectors on strides make a collision-free and perfect O(1) IP lookup. IP lookup simulation with a large scale BGP table shows that our PIHT offers 3.6 and 7.1 times memory efficiency than other contemporary schemes for 160Gbps routers.
منابع مشابه
Fast and deterministic hash table lookup using discriminative bloom filters
Hash tables are widely used in network applications, as they can achieve O(1) query, insert, and delete operations at moderate loads. However, at high loads, collisions are prevalent in the table, which increases the access time and induces non-deterministic performance. Slow rates and non-determinism can considerably hurt the performance and scalability of hash tables in the multi-threaded par...
متن کاملEMOMA: Exact Match in One Memory Access
An important function in modern routers and switches is to perform a lookup for a key. Hash-based methods, and in particular cuckoo hash tables, are popular for such lookup operations, but for large structures stored in off-chip memory, such methods have the downside that they may require more than one off-chip memory access to perform the key lookup. Although the number of off-chip memory acce...
متن کاملBloom-Based Filters for Hierarchical Data
In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called Breadth and Depth Bloom filters, which in contrast to traditional hash-based indexes, are able to summarize hierarchical data and support regular path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structur...
متن کاملA Privacy Preserving Model for Ownership Indexing in Distributed Storage Systems
The indexing technique in distributed object storage system is the crucial part of a large scale application, where the index data structure may be published in many nodes. Here arises a problem on preserving the privacy of the ownership information while supporting queries on item locations with limited index space. Probabilistic data structure, such as the bloom filter which records the locat...
متن کاملHardened Bloom Filters, with an Application to Unobservability
Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership of a given element in the set, with some probability of false positive answers. Bloom filters are often used in caching system to check that some requested data actually exist before doing a co...
متن کامل